// numberPositionSort#include<stdio.h>int biggest = 0, i;int cnt[1001];void numberPositionSort (int n, int * a);int main () {        int a[1001];    int n;        scanf("%d", &n);     for (i=0; i<n ; i++) {        scanf("%d",&a[i]);    }        for (i=0; i<n ; i++) {        if (a[i]>biggest)            biggest = a[i];    }        numberPositionSort (n, a);        for (i=0; i<=biggest; i++) {        if (cnt[i]!=0) {            printf("%d ",i);            cnt[i]--;            i--;        }    }    }void numberPositionSort (int n, int * a){        int num;        for (i=0; i<n ; i++) {        num = a[i];        cnt[num]++;    }    }